Asymptotics and Non-Asymptotics for Universal Fixed-to-Variable Source Coding
نویسندگان
چکیده
منابع مشابه
Universal variable-to-fixed length source codes
A universal variable-to-fixed length algorithm for binary memoryless sources which converges to the entropy of the source at the optimal rate is known. We study the problem of universal variable-to-fixed length coding for the class of Markov sources with finite alphabets. We give an upper bound on the performance of the code for large dictionary sizes and show that the code is optimal in the se...
متن کاملTo “ Fixed - Smoothing Asymptotics for Time Series
We assume the (i, j)th element and the (j, i)th element of Σ are functionally unrelated. The results can be extended to the case where symmetric matrix elements are considered functionally equal (see e.g., McCulloch [5]). In the following, we use ⊗ to denote the Kronecker product in matrix algebra and use vec to denote the operator that transforms a matrix into a column vector by stacking the c...
متن کاملAsymptotics for fixed transaction costs
An investor with constant relative risk aversion trades a safe and several risky assets with constant investment opportunities. For a small fixed transaction cost, levied on each trade regardless of its size, we explicitly determine the leading-order corrections to the frictionless value function and optimal policy.
متن کاملOn Asymptotics of Certain Recurrences Arising in Universal Coding
Ramanujan's Q-function, Lambert W-function, and the so called \tree function" T(z) deened implicitly by the equation T(z) = ze T(z) found applications in hashing, the birthday paradox problem, random mappings, caching, memory connicts, and so forth. Recently, several novel applications of these functions to information theory problems such as linear coding and universal portfolios were brought ...
متن کاملNon-Asymptotic Converse Bounds and Refined Asymptotics for Two Lossy Source Coding Problems
In this paper, we revisit two multi-terminal lossy source coding problems: the lossy source coding problem with side information available at the encoder and one of the two decoders, which we term as the Kaspi problem (Kaspi, 1994), and the multiple description coding problem with one semi-deterministic distortion measure, which we refer to as the Fu-Yeung problem (Fu and Yeung, 2002). For the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2017
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2017.2686881